Quasi-static scheduling of communicating tasks
نویسندگان
چکیده
منابع مشابه
Quasi-Static Scheduling of Communicating Tasks
Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the quasi-static scheduling problem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted distributed task model consists of a network of sequential processes ...
متن کاملQuasi - Static Scheduling of Embedded
Embedded system design requires the use of eecient scheduling policies to execute on shared resources, e.g. the processor, algorithms that consist of a set of concurrent tasks with complex mutual dependencies. Scheduling techniques are called static when the schedule is computed at compile time, dynamic when some or all decisions are made at run-time. The choice of the scheduling policy mainly ...
متن کاملCommunicating Intent for Planning and Scheduling Tasks
This paper concerns the relation between people, technology and cognitive work, in planning and scheduling remote, temporally extended telerobotic action. We combined a computational theory of planning with ethnographic methods to design a framework for expressing the intent behind requested science observations for the 2004 Mars Exploration Rover mission. The evolution and usage of this framew...
متن کاملQuasi-Static Scheduling for SCORE
Previous work introduced a dynamic compute model aimed at eliminating existing barriers to the widespread efficient exploitation of reconfigurable devices. Among other achievements this model decoupled application design-time decisions from the run-time physical resource bindings. The compute model uses graphs of compute pages and memory blocks connected by stream links to capture the definitio...
متن کاملStatic-priority scheduling of multiframe tasks
The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of Liu and Layland (Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), pp. 46{61. 1973 ). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.09.005